On rings with central polynomials
نویسندگان
چکیده
منابع مشابه
On a generalization of central Armendariz rings
In this paper, some properties of $alpha$-skew Armendariz and central Armendariz rings have been studied by variety of others. We generalize the notions to central $alpha$-skew Armendariz rings and investigate their properties. Also, we show that if $alpha(e)=e$ for each idempotent $e^{2}=e in R$ and $R$ is $alpha$-skew Armendariz, then $R$ is abelian. Moreover, if $R$ is central $alpha$-skew A...
متن کاملOn Unit-Central Rings
We establish commutativity theorems for certain classes of rings in which every invertible element is central, or, more generally, in which all invertible elements commute with one another. We prove that if R is a semiexchange ring (i.e. its factor ring modulo its Jacobson radical is an exchange ring) with all invertible elements central, then R is commutative. We also prove that if R is a semi...
متن کاملWedderburn Polynomials over Division Rings
A Wedderburn polynomial over a division ring K is a minimal polynomial of an algebraic subset of K. Special cases of such polynomials include, for instance, the minimal polynomials (over the center F = Z(K)) of elements of K that are algebraic over F . In this note, we give a survey on some of our ongoing work on the structure theory of Wedderburn polynomials. Throughout the note, we work in th...
متن کاملOn Inverses for Quadratic Permutation Polynomials over Integer Rings
Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient condition that determines the least degree inverse of a quadratic permutation polynomial is proven. Moreover, an algorithm is provided to explicitly compute th...
متن کاملLDPC Convolutional Codes Based on Permutation Polynomials over Integer Rings
A novel algebraic construction technique for LDPC convolutional codes (LDPCCCs) based on permutation polynomials over integer rings is presented. The underlying elements of this construction technique are graph automorphisms and quasi-cyclic (QC) codes. The algebraic structure of the obtained LDPCCCs, their encoding and decoding are discussed. These new codes have a special structure, which is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1974
ISSN: 0021-8693
DOI: 10.1016/0021-8693(74)90122-7